Recoverable Robust Timetables: An Algorithmic Approach on Trees

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recoverable Robust Timetables on Trees

In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivation behind it is to cope with scheduled activities which might be subject to unavoidable disruptions, such as delays, occurring during the operational phase. The idea is to preventively plan some extra time for the sch...

متن کامل

Generating Hasse trees of fuzzy preorder closures: an algorithmic approach

Mathematical theories are pervaded with the use of partial orders and more general preorders also called quasi orders i e re exive and transitive binary rela tions Preorders also play an important role in appli cations for instance as preference relations in multi criteria decision aid techniques The observation that classical relations do not allow to express partial or graded relationships ha...

متن کامل

Recoverable Robust Timetable Information

Timetable information is the process of determining a suitable travel route for a passenger. Due to delays in the original timetable, in practice it often happens that the travel route cannot be used as originally planned. For a passenger being already en route, it would hence be useful to know about alternatives that ensure that his/her destination can be reached. In this work we propose a rec...

متن کامل

On the recoverable robust traveling salesman problem

We consider an uncertain traveling salesman problem, where distances between nodes are not known exactly, but may stem from an uncertainty set of possible scenarios. This uncertainty set is given as intervals with an additional bound on the number of distances that may deviate from their expected, nominal value. A recoverable robust model is proposed, that allows a tour to change a bounded numb...

متن کامل

A Recoverable Robust Approach for the Next Release Problem

Selecting a set of requirements to be included in the next software release, which has become to be known as the Next Release Problem, is an important issue in the iterative and incremental software development model. Since software development is performed under a dynamic environment, some requirements aspects, like importance and effort cost values, are highly subject to uncertainties, which ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Computers

سال: 2011

ISSN: 0018-9340

DOI: 10.1109/tc.2010.142